Backwards Analysis of the Karger-Klein-Tarjan Algorithm for Minimum Spanning Trees
نویسنده
چکیده
This note gives a short proof of a sampling lemma used by Karger, Klein, and Tatjan in the analysis of their randomized linear-time algorithm for minimum spanning trees.
منابع مشابه
Lecture notes for “Analysis of Algorithms”: Minimum Spanning Trees
We present a general framework for obtaining efficient algorithms for computing minimum spanning trees. We use this framework to derive the classical algorithms of Prim, Kruskal and Bor̊uvka. We then describe the randomized linear-time algorithm of Karger, Klein and Tarjan. The algorithm of Karger, Klein and Tarjan uses deterministic linear-time implementations of a verification algorithm of Kom...
متن کاملThe Entropy of Backwards Analysis
Backwards analysis, first popularized by Seidel, is often the simplest most elegant way of analyzing a randomized algorithm. It applies to incremental algorithms where elements are added incrementally, following some random permutation, e.g., incremental Delauney triangulation of a pointset, where points are added one by one, and where we always maintain the Delauney triangulation of the points...
متن کاملSensitivity Analysis of Minimum Spanning Trees in Sub-inverse-Ackermann Time
We present a deterministic algorithm for computing the sensitivity of a minimum spanning tree (MST) or shortest path tree in O(m logα(m,n)) time, where α is the inverse-Ackermann function. This improves upon a long standing bound of O(mα(m,n)) established by Tarjan. Our algorithms are based on an efficient split-findmin data structure, which maintains a collection of sequences of weighted eleme...
متن کاملRandom Sampling in Matroids, with Applications to Graph Connectivity and Minimum Spanning Trees
Random sampling i s a powerful way t o gather informat ion about a group by considering only a small part of it. W e give a paradigm f o r applying this technique to optimization problems, and demonstrate its effectiveness o n matroids. Matroids abstractly model many optimization problems that can be solved by greedy methods, such as the minimum spanning tree ( M S T ) problem. Our results have...
متن کاملState-of-the-Art Algorithms for Minimum Spanning Trees∗ A Tutorial Discussion
The classic “easy” optimization problem is to find the minimum spanning tree (MST) of a connected, undirected graph. Good polynomial-time algorithms have been known since 1930. Over the last 10 years, however, the standard O(m log n) results of Kruskal and Prim have been improved to linear or near-linear time. The new methods use several tricks of general interest in order to reduce the number ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 67 شماره
صفحات -
تاریخ انتشار 1998